On the Construction of Sets of Mutually Orthogonal Latin Squares and the Falsity of a Conjecture of Eulero)
نویسنده
چکیده
then it is known, MacNeish [16] and Mann [17] that there exists a set of at least n(v) mutually orthogonal Latin squares (m.o.l.s.) of order v. It seemed plausible that n(v) is also the maximum possible number of m.o.l.s. of order v. This would have implied the correctness of Euler's [13] conjecture about the nonexistence of two orthogonal Latin squares of order v when v = 2 (mod 4), since n(v) = 1 in this case. If we denote by N(v) the maximum possible number of mutually orthogonal Latin squares of order v, then Parker [18] showed that in certain cases N(v) >n(v) by proving that if there exists a balanced incomplete block (BIB) design with v treatments, X = 1, and block size k which is a prime power then N(v)^k — 2. This result cast a doubt on the validity of Euler's conjecture. In this paper we generalize Parker's method of constructing m.o.l.s., by showing that a very general class of designs, which we have called pairwise balanced designs of index unity, can be used for the construction of sets of m.o.l.s. Various applications of this method have been made. In particular we show that Euler's conjecture is false for an infinity of values of v, including all values of the form 36w + 22. We also provide a table for all values of i>sS150, for which our methods enable us to show that N(v) >n(v). The smallest number for which we have been able to demonstrate the falsity of Euler's conjecture is 22. Two orthogonal squares of order 22 constructed by our method are given in the Appendix. Several attempts, necessarily erroneous, have been made in the past to prove Euler's conjecture, e.g., Peterson [19], Wernicke [20] and MacNeish [16]. Levi [14, p. 14] points
منابع مشابه
New construction of mutually unbiased bases in square dimensions
We show that k = w + 2 mutually unbiased bases can be constructed in any square dimension d = s provided that there are w mutually orthogonal Latin squares of order s. The construction combines the design-theoretic objects (k, s)-nets (which can be constructed from w mutually orthogonal Latin squares of order s and vice versa) and generalized Hadamard matrices of size s. Using known lower bound...
متن کاملConstructing Mutually Unbiased Bases from Quantum Latin Squares
We introduce orthogonal quantum Latin squares, which restrict to traditional orthogonal Latin squares, and investigate their application in quantum information science. We use quantum Latin squares to build maximally entangled bases, and show how mutually unbiased maximally entangled bases can be constructed in square dimension from orthogonal quantum Latin squares. We also compare our construc...
متن کاملDiscrete phase-space approach to mutually orthogonal Latin squares
Abstract. We show there is a natural connection between Latin squares and commutative sets of monomials defining geometric structures in finite phase-space of prime power dimensions. A complete set of such monomials defines a mutually unbiased basis (MUB) and may be associated with a complete set of mutually orthogonal Latin squares (MOLS). We translate some possible operations on the monomial ...
متن کاملFurther Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
MacNeish's conjecture was disproved by Parker (12) who showed that in certain cases N(v) > n(v) by proving that if there exists a balanced incomplete block (BIB) design with v treatments, A = 1, and block size k which is a prime power then N(v) > k — 2, and that this result can be improved to N(v) > k — 1, when the design is symmetric and cyclic. Parker's result though it did not disprove Euler...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010